Distributed Algorithms for Multirobot Task Assignment With Task Deadline Constraints
نویسندگان
چکیده
منابع مشابه
Heuristic task assignment for distributed computing systems
This paper addresses the problem of assigning a task with precedence constraint to a dist~buted computing system. The task turnaround time incIuding communication overhead and idle time is adopted to measure the performance of task assignment. The task assignment in this paper requires one to determine not only the assignment of modules, but also the sequence of message transmission to balance ...
متن کاملExact Algorithms for a Task Assignment Problem
We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A search. We report simulation results over a wide range of parameters ...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملTask Assignment on Distributed-memory Systems with Adaptive Wormhole Routing Task Assignment on Distributed-memory Systems with Adaptive Wormhole Routing
Assignment of tasks of a parallel program onto processors of a distributed-memory system is critical to obtain minimal program completion time by minimizing communication overhead. Wormhole-routing switching technique, with various adaptive routing strategies, is increasingly becoming the trend to build scalable distributed-memory systems. This paper presents task assignment heuristics for such...
متن کاملTask Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constraints. This paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems have also a large number of constraints of different nature, such as cost, execution time, memory capaci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automation Science and Engineering
سال: 2015
ISSN: 1545-5955,1558-3783
DOI: 10.1109/tase.2015.2438032